Cs - R 9633 1996

In this paper we propose a simple framework based on rst-order logic, for the design and decomposition of abstract domains for static analysis. An assertion language is chosen that speciies the properties of interest, and abstract domains are deened to be suitably chosen sets of assertions. Composition and decomposition of abstract domains is facilitated by their logical speciication in rst-order logic. In particular, the operations of reduced product and disjunctive completion are formalized in this framework. Moreover, the notion of (conjunctive) factorization of sets of assertions is introduced, that allows one to decompose domains in`disjoint' parts. We illustrate the use of this framework by studying typical abstract domains for ground-dependency and aliasing analysis in logic programming.